Renormalisation from non-geometric to geometric rough paths
نویسندگان
چکیده
L’application de Hairer–Kelly a été introduite pour établir une correspondance entre les chemins rugueux géométriques et non-géométriques. Récemment, nouvelle renormalisation sur proposée dans (Proc. Lond. Math. Soc. 121(2) (2020) 220–251), construite d’après cette application le théorème d’extension Lyons–Victoir. Dans ce travail, on compare avec celles déjà existantes comme la BPHZ des produits locaux. On montre qu’elles commutent un certain sens l’application dévoile formule explicite contexte 220–251). considère aussi comportement ces renormalisations l’approche alternative (Ann. Inst. Henri Poincaré Probab. Stat. 55(2) (2019) 1131–1148) qui permet passer d’un chemin non-géométrique à géométrique.
منابع مشابه
Geometric versus non-geometric rough paths
In this article we consider rough differential equations (RDEs) driven by non-geometric rough paths, using the concept of branched rough paths introduced in [Gub10]. We first show that branched rough paths can equivalently be defined as γ-Hölder continuous paths in some Lie group, akin to geometric rough paths. We then show that every branched rough path can be encoded in a geometric rough path...
متن کاملGeometric kth shortest paths
1 This paper studies algorithmic and combinatorial properties of shortest paths of different homo2 topy types in a polygonal domain with holes. We define the “second shortest path” to be the shortest 3 path that is homotopically different from the (first) shortest path; the kth shortest path for an arbitrary 4 integer k is defined analogously. We introduce the “kth shortest path map”—a structur...
متن کاملGeometric k Shortest Paths
We consider the problem of computing k shortest paths in a two-dimensional environment with polygonal obstacles, where the jth path, for 1 j k, is the shortest path in the free space that is also homotopically distinct from each of the first j 1 paths. In fact, we consider a more general problem: given a source point s, construct a partition of the free space, called the kth shortest path m...
متن کاملApproximating Geometric Bottleneck Shortest Paths
In a geometric bottleneck shortest path problem, we are given a set S of n points in the plane, and want to answer queries of the following type: Given two points p and q of S and a real number L, compute (or approximate) a shortest path between p and q in the subgraph of the complete graph on S consisting of all edges whose lengths are less than or equal to L. We present efficient algorithms f...
متن کاملA Geometric Renormalisation Group in Discrete Quantum Space-Time
We model quantum space-time on the Planck scale as dynamical networks of elementary relations or time dependent random graphs, the time dependence being an effect of the underlying dynamical network laws. We formulate a kind of geometric renormalisation group on these (random) networks leading to a hierarchy of increasingly coarse-grained networks of overlapping lumps. We provide arguments that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l'I.H.P
سال: 2022
ISSN: ['0246-0203', '1778-7017']
DOI: https://doi.org/10.1214/21-aihp1178